The Incremental Pareto-Coevolution Archive
نویسنده
چکیده
Coevolution can in principle provide progress for problems where no accurate evaluation function is available. An important open question however is how coevolution can be set up such that progress can be ensured. Previous work has provided progress guarantees either for limited cases or using strict acceptance conditions that can result in stalling. We present a monotonically improving archive for the general asymmetric case of coevolution where learners and tests may be of distinct types, for which any detectable improvement can be accepted into the archive. The Incremental Pareto-Coevolution Archive is demonstrated in experiments.
منابع مشابه
Training Binary GP Classifiers Efficiently: A Pareto-coevolutionary Approach
The conversion and extension of the Incremental Pareto-Coevolution Archive algorithm (IPCA) into the domain of Genetic Programming classification is presented. In particular, the coevolutionary aspect of the IPCA algorithm is utilized to simultaneously evolve a subset of the training data that provides distinctions between candidate classifiers. Empirical results indicate that such a scheme sig...
متن کاملIntransitivity in Coevolution
We review and investigate the current status of intransitivity as a potential obstacle in coevolution. Pareto-Coevolution avoids intransitivity by translating any standard superiority relation into a transitive Pareto-dominance relation. Even for transitive problems though, cycling is possible. Recently however, algorithms that provide monotonic progress for Pareto-Coevolution have become avail...
متن کاملCooperative Problem Decomposition in Pareto Competitive Classifier Models of Coevolution
Pareto competitive models of coevolution have the potential to provide a number of distinct advantages over the canonical approach to training under the Genetic Programming (GP) classifier domain. Recent work has specifically focused on the reformulation of training as a two-population competition, that is learners versus training exemplars. Such a scheme affords, for example, the capacity to d...
متن کاملHybrid multiobjective evolutionary algorithm based technique for economic emission load dispatch optimization problem
In this paper, we present a hybrid approach combining two optimization techniques for solving economic emission load dispatch (EELD) optimization problem. The proposed approach integrates the merits of both genetic algorithm (GA) and local search (LS), where it employs the concept of coevolution and repair algorithm for handling nonlinear constraints, also, it maintains a finite-sized archive o...
متن کاملStochastic convergence of random search to fixed size Pareto set approximations
This paper presents the first convergence result for random search algorithms to a subset of the Pareto set of given maximum size k with bounds on the approximation quality ǫ. The core of the algorithm is a new selection criterion based on a hypothetical multilevel grid on the objective space. It is shown that, when using this criterion for accepting new search points, the sequence of solution ...
متن کامل